An algorithm for Secure Formatting of memory
نویسنده
چکیده
Flash memories find wide use in storing data in any application. Data deletion in flash memories involves making the data unreliable on the device. As contents get deleted in the flash memory, time is consumed in deleting the data on the flash permanently. This paper proposes a method to make the contents of the deleted blocks in the flash memory unreliable. The proposed method makes data unreliable by swapping most significant bits into least significant bits in block of data making data recovery impossible
منابع مشابه
A Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملSecure Bio-Cryptographic Authentication System for Cardless Automated Teller Machines
Security is a vital issue in the usage of Automated Teller Machine (ATM) for cash, cashless and many off the counter banking transactions. Weaknesses in the use of ATM machine could not only lead to loss of customer’s data confidentiality and integrity but also breach in the verification of user’s authentication. Several challenges are associated with the use of ATM smart card such as: card clo...
متن کاملClustering and Memory-based Parent-Child Swarm Meta-heuristic Algorithm for Dynamic Optimization
So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملTabular formatting problemsz
Tabular formatting determines the physical dimensions of tables according to size constraints. Many factors contribute to the complexity of the formatting process so we analyze the computational complexity of tabular formatting with respect to diierent restrictions. We also present an algorithm for tabular formatting that we have implemented in a prototype system. It supports automatic line bre...
متن کامل